Discriminant Metric Learning Approach for Face Verification

نویسندگان

  • Ju-Chin Chen
  • Pei-Hsun Wu
  • Jenn-Jier James Lien
چکیده

In this study, we propose a distance metric learning approach called discriminant metric learning (DML) for face verification, which addresses a binary-class problem for classifying whether or not two input images are of the same subject. The critical issue for solving this problem is determining the method to be used for measuring the distance between two images. Among various methods, the large margin nearest neighbor (LMNN) method is a state-of-the-art algorithm. However, to compensate the LMNN’s entangled data distribution due to high levels of appearance variations in unconstrained environments, DML’s goal is to penalize violations of the negative pair distance relationship, i.e., the images with different labels, while being integrated with LMNN to model the distance relation between positive pairs, i.e., the images with the same label. The likelihoods of the input images, estimated using DML and LMNN metrics, are then weighted and combined for further analysis. Additionally, rather than using the k-nearest neighbor (k-NN) classification mechanism, we propose a verification mechanism that measures the correlation of the class label distribution of neighbors to reduce the false negative rate of positive pairs. From the experimental results, we see that DML can modify the relation of negative pairs in the original LMNN space and compensate for LMNN’s performance on faces with large variances, such as pose and expression.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fusion of PCA-Based and LDA-Based Similarity Measures for Face Verification

The problem of fusing similarity measure-based classifiers is considered in the context of face verification. The performance of face verification systems using different similarity measures in two well-known appearance-based representation spaces, namely Principle Component Analysis (PCA) and Linear Discriminant Analysis (LDA) is experimentally studied. The study is performed for both manually...

متن کامل

On Matching Scores for LDA-based Face Verification

We address the problem of face verification using linear discriminant analysis and investigate the issue of matching score1. We establish the reason behind the success of the normalised correlation. The improved understanding about the role of metric then naturally leads to a novel way of measuring the distance between a probe image and a model. In extensive experimental studies on the publicly...

متن کامل

Neural Class-Specific Regression for face verification

Face verification is a problem approached in the literature mainly using nonlinear class-specific subspace learning techniques. While it has been shown that kernel-based ClassSpecific Discriminant Analysis is able to provide excellent performance in smalland medium-scale face verification problems, its application in today’s large-scale problems is difficult due to its training space and comput...

متن کامل

Cross Euclidean-to-Riemannian Metric Learning with Application to Face Recognition from Video

Riemannian manifolds have been widely employed for video representations in visual classification tasks including videobased face recognition. The success mainly derives from learning a discriminant Riemannian metric which encodes the non-linear geometry of the underlying Riemannian manifolds. In this paper, we propose a novel metric learning framework to learn a distance metric across a Euclid...

متن کامل

Zafeiriou, Stefanos and Tzimiropoulos, Georgios and Petrou, Maria and Stathaki, Tania (2012) Regularized kernel discriminant analysis with a robust kernel for face recognition and verification. IEEE Transactions on Neural Networks and Learning

We propose a robust approach to discriminant kernel-based feature extraction for face recognition and verification. We show, for the first time, how to perform the eigen analysis of the within-class scatter matrix directly in the feature space. This eigen analysis provides the eigenspectrum of its range space and the corresponding eigenvectors as well as the eigenvectors spanning its null space...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • TIIS

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2015